北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (6): 36-39.doi: 10.13190/jbupt.200706.36.030

• 论文 • 上一篇    下一篇

并行图染色的无线网状网络媒体接入控制

张学聃1, 洪 珺1, 张 林1, 李安国1,2,山秀明1   

  1. (1. 清华大学 电子工程系, 北京 100084; 2. 香港大学 电机电子工程学系, 香港 )
  • 收稿日期:2007-04-25 修回日期:2007-07-13 出版日期:2007-12-31 发布日期:2007-12-31
  • 通讯作者: 张学聃

A Medium Access Control Algorithm Based on Parallel Graph Coloring for Wireless Mesh Networks

ZHANG Xue-dan 1, HONG Jun 1, ZHANG Lin 1, LI Victor On Kwok1,2, SHAN Xiu-ming 1   

  1. (1. Department of Electronic Engineering, Tsinghua University, Beijing 100084, China;
    2. Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, China)
  • Received:2007-04-25 Revised:2007-07-13 Online:2007-12-31 Published:2007-12-31
  • Contact: Zhang Xuedan

摘要:

将无线网状网络的传输调度建模为冲突图染色问题,提出了一种新颖的基于并行图染色的分布式时分多址媒体接入控制(MAC)算法。该算法充分利用无线路由器和无线骨干网的自身优势,只需要依靠网络的局部拓扑和负载信息,对无线接入网的传输调度实现全局优化。仿真结果表明,所提算法性能十分接近最优调度,并且通信开销成本非常低。

关键词: 无线网状网络, 媒体接入控制, 并行图染色, 分布式调度算法

Abstract:

The transmission scheduling of wireless mesh networks (WMNs) is modeled as a problem of conflict graph coloring. a new distributed time division multiple access(TDMA) medium access control(MAC) algorithm based on parallel graph coloring is proposed. The algorithm utilizes the advantages of mesh routers and backbone networks, and only depends on local topology and traffic load information. Simulation demonstrates that the proposed scheme achieves significant throughput enhancement approaching optimal scheduling in WMNs, and enjoys very low communication overhead.

Key words: wireless mesh networks, medium access control, parallel graph coloring, distributed scheduling algorithm

中图分类号: